Generic criticality of community structure in random graphs

We examine a community structure in random graphs of size n and link probability p/n determined with the Newman greedy optimization of modularity. Calculations show that for p<1 communities are nearly identical with clusters. For p=1 the average sizes of a community s(av) and of the giant community s(g) show a power-law increase s(av)∼n(α') and s(g)∼n(α). From numerical results we estimate α'≈0.26(1) and α≈0.50(1) and using the probability distribution of sizes of communities we suggest that α'=α/2 should hold. For p>1 the community structure remains critical: (i) s(av) and s(g) have a power-law increase with α'≈α<1 and (ii) the probability distribution of sizes of communities is very broad and nearly flat for all sizes up to s(g). For large p the modularity Q decays as Q∼p(-0.55), which is intermediate between some previous estimations. To check the validity of the results, we also determine the community structure using another method, namely, a nongreedy optimization of modularity. Tests with some benchmark networks show that the method outperforms the greedy version. For random graphs, however, the characteristics of the community structure determined using both greedy and nongreedy optimizations are, within small statistical fluctuations, the same.